Analyzing P2P Overlays with Recursive Queries
نویسندگان
چکیده
We explore the utility and execution of recursive queries as an interface for querying distributed network graph structures. To illustrate the power of recursive queries, we give several examples of computing structural properties of a P2P network such as reachability and resilience. To demonstrate the feasibility of our proposal, we sketch execution strategies for these queries using PIER, a P2P relational query processor over Distributed Hash Tables (DHTs). Finally, we discuss the relationship between innetwork query processing and distance-vector like routing protocols.
منابع مشابه
Performance Analysis of R/kademlia, Pastry and Bamboo Using Recursive Routing in Mobile Networks
We are experiencing a revolution in the wireless technology and mobile phone networks as they are becoming increasingly ubiquitous. On the other hand, there is another trend, gaining extreme popularity over the traditional wired Internet: Peer-to-Peer (P2P) networking. Specifically, Distributed Hash Table (DHT) based Structured P2P overlay networks are capable to facilitate information storage ...
متن کاملSimilarity Discovery in Structured P2P Overlays
Peer-to-peer (P2P) overlays are appealing, since they can aggregate resources of end systems without relying on sophisticated infrastructures. Services can thus be rapidly deployed over such overlays. Primitive P2P overlays only support searches with single keywords. For queries with multiple keywords, presently only unstructured P2P systems can support by extensively employing message flooding...
متن کاملMachine Learning for Efficient Neighbor Selection in Unstructured P2P Networks
Self-reorganization offers the promise of improved performance, scalability and resilience in Peer-to-Peer (P2P) overlays. In practice however, the benefit of reorganization is often lower than the cost incurred in probing and adapting the overlay. We employ machine learning feature selection in a novel manner: to reduce communication cost thereby providing the basis of an efficient neighbor se...
متن کاملP2P Architectures for Semantic Service Composition
Service discovery enables consumers to find, in a space of available services (i.e. service repository), the desired ones. Composition is useful when no simple service is able to satisfy user’s needs by itself: (partially) ordered collections of services may instead be able to solve the requested goals. Each service (and service requests) can be represented as a transition from a set of states ...
متن کاملNotre Dame in Partial Fulfillment of the Requirements for the Degree of Master of Science
by William F. Acosta Peer-to-peer (P2P) networks are decentralized, distributed networks where the participating nodes self-organize and communicate with each other to support a distributed application. P2P networks have been used to support such diverse applications as file sharing, distributed storage and backup, and content distribution. Because P2P networks are decentralized, the manner in ...
متن کامل